Using Branching Time Logic to Optimize an Extended Class of Datalog Queries
نویسندگان
چکیده
We propose an extension of the branching time transforma tion which can handle a signi cantly broader class of Datalog pro grams The initial transformation could only be applied to Chain Data log a useful but restricted class of programs In this paper we demon strate that the transformation of can be extended to handle all Datalog programs that do not allow multiple consumptions of variables in clauses We demonstrate the correctness of the new transformation and provide certain optimizations that further improve the programs obtained by the transformation
منابع مشابه
Efficient Datalog Queries with Time and Space Complexity Guarantees Efficient Datalog Queries with Time and Space Complexity Guarantees
of the Dissertation Efficient Datalog Queries with Time and Space Complexity Guarantees by Kazım Tuncay Tekle Doctor of Philosophy in Computer Science Stony Brook University 2010 Many complex analysis problems can be most clearly and easily specified as logic rules and queries, where rules specify how given facts can be combined to infer new facts, and queries select facts of interest to the an...
متن کاملExpressiveness of Semipositive Logic Programs with Value Invention
We study the expressive power of the relational query language wILOG 1 2 ;: of semipositive datalog programs extended with a mechanism of safe value invention. We adopt a semantics for value invention based on the use of Skolem functor terms. We show that this language expresses exactly the class of semimonotone queries, that is, the class of computable queries that are preserved under extensions.
متن کاملPolynomial Datalog Rewritings for Expressive Description Logics with Closed Predicates
We consider instance queries mediated by an ontology expressed in the expressive DL ALCHIO with closed predicates. We observe that such queries are non-monotonic and cannot be expressed in monotonic variants of DATALOG, but a polynomial time translation into disjunctive DATALOG extended with negation as failure is feasible. If no closed predicates are present–in the case of classical instance c...
متن کاملNondeterministic, Nonmonotonic Logic Databases
We consider in this paper an extension of Datalog with mechanisms for temporal, nonmonotonic and nondeterministic reasoning, which we refer to as Datalog++. We show, by means of examples, its exibil-ity in expressing queries concerning aggregates and data cube. Also, we show how iterated xpoint and stable model semantics can be combined to the purpose of clarifying the semantics of Datalog++ pr...
متن کاملComputing Datalog Rewritings for Disjunctive Datalog Programs and Description Logic Ontologies
We study the closely related problems of rewriting disjunctive datalog programs and non-Horn DL ontologies into plain datalog programs that entail the same facts for every dataset. We first propose the class of markable disjunctive datalog programs, which is efficiently recognisable and admits polynomial rewritings into datalog. Markability naturally extends to SHI ontologies, and markable onto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003